Unavoidable topological minors of infinite graphs
نویسندگان
چکیده
منابع مشابه
Unavoidable topological minors of infinite graphs
A graph G is loosely-c-connected, or l-c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite component and a graph containing at most d vertices. In this paper, we give the structure of a set of l-c-connected infinite graphs that form an unavoidable set among the topological minors of l-c-connected infinite gr...
متن کاملUnavoidable minors of graphs of large type
In this paper, we study one measure of complexity of a graph, namely its type. The type of a graph G is deened to be the minimum number n such that there is a sequence of graphs G = G 0 , G 1 , : : : , G n , where G i is obtained by contracting one edge in or deleting one edge from each block of G i?1 , and where G n is edgeless. We show that a 3-connected graph has large type if and only if it...
متن کاملUnavoidable parallel minors of 4-connected graphs
A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degre...
متن کاملForcing Large Complete (Topological) Minors in Infinite Graphs
It is well known that in finite graphs, large complete minors/topological minors can be forced by assuming a large average degree. Our aim is to extend this fact to infinite graphs. For this, we generalize the notion of the relative end degree, which had been previously introduced by the first author for locally finite graphs, and show that large minimum relative degree at the ends and large mi...
متن کاملCompact topological minors in graphs
Let be a real number such that 0< <2 and t a positive integer. Let n be a sufficiently large positive integer as a function of t and . We show that every n-vertex graph with at least n1+ edges contains a subdivision of Kt in which each edge of Kt is subdivided less than 10/ times. This refines the main result in [A. Kostochka and Pyber, Combinatorica 8 (1988), 83–86] and resolves an open questi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2010
ISSN: 0012-365X
DOI: 10.1016/j.disc.2010.08.014